A Time-Space Tradeo for Undirected Graph Traversal by Walking Automata

We prove a time-space tradeo for traversing undirected graphs, using a structured model that is a nonjumping variant of Cook and Racko 's \Jumping Automata for Graphs". This material is based upon work supported in part by the Natural Sciences and Engineering Research Council of Canada, by the National Science Foundation under Grants CCR-8703196, CCR-8858799, CCR-8907960, and CCR9002891, and by IBM under Research Contract 16980043. A portion of this work was performed while the fourth author was visiting the University of Toronto, whose hospitality is gratefully acknowledged. y Department of Computer Science and Engineering, University of Washington, Box 352350, Seattle, WA, U.S.A. 98195 z Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 1A4 x IBM Research Division, Thomas J. Watson Research Center, P. O. Box 218, Yorktown Heights, NY, U.S.A. 10598